Ant-Based Crossover for Permutation Problems
نویسندگان
چکیده
Crossover for evolutionary algorithms applied to permutation problems is a difficult and widely discussed topic. In this paper we use ideas from ant colony optimization to design a new permutation crossover operator. One of the advantages of the new crossover operator is the ease to introduce problem specific heuristic knowledge. Empirical tests on a travelling salesperson problem show that the new crossover operator yields excellent results and significantly outperforms evolutionary algorithms with edge recombination operator as well as pure ant colony optimization.
منابع مشابه
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on the observation of real ants collective foraging behaviour. The idea is to model the problem as the search of a best path in a graph. Artificial ants walk trough this graph, in a stochastic and incomplete way, searching for good...
متن کاملAn Improved Ant Colony Algorithm for Genome Rearrangements
Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit d...
متن کاملPerformances's study on crossover operators keeping good schemata for some scheduling problems
In this paper, we deal with genetic algorithms (GAs) solving some permutation scheduling problems. Considering only the permutation codes and only the crossover-phase of a GA on a very large population, a comparison study of di erent crossover operators was done earlier according to some performance indicators. Here, we develop a tool generating a large scale of scheduling instances and of perm...
متن کاملAn Efficient Ant Colony Optimization for Real Parameter Optimization
This paper presents an ant colony optimization based algorithm to solve real parameter optimization problems. In the proposed method, an operation similar to the crossover of the genetic algorithm is introduced into the ant colony optimization. The crossover operation with Laplace distribution following a few promising descent directions (FPDD-LX) is proposed to be performed on the pheromone of...
متن کاملOn solving permutation scheduling problems with ant colony optimization
A new approach for solving permutation scheduling problems with Ant Colony Optimization is proposed in this paper. The approach assumes that no precedence constraints between the jobs have to be fulfilled. It is tested with an ant algorithm for the Single Machine Total Weighted Deviation Problem. In the new approach ants allocate the places in the schedule not sequentially, as in the standard a...
متن کامل